On triangulation axes of polygons
نویسندگان
چکیده
We propose the triangulation axis as an alternative skeletal structure for a simple polygon P . This axis is a straight-line tree that can be interpreted as an anisotropic medial axis of P , where inscribed disks are line segments or triangles. The underlying triangulation that specifies the anisotropy can be varied, to adapt the axis so as to reflect predominant geometrical and topological features of P . Triangulation axes typically have much fewer edges and branchings than the Euclidean medial axis or the straight skeleton of P . Still, they retain important properties, as for example the reconstructability of P from its skeleton. Triangulation axes can be computed from their defining triangulations in O(n) time. We investigate the effect of using several optimal triangulations for P . In particular, careful edge flipping in the constrained Delaunay triangulation leads, in O(n logn) overall time, to an axis competitive to ‘high quality axes’ requiring Θ(n) time for optimization via dynamic programming.
منابع مشابه
Touring a Sequence of Weighted Polygons
In this paper we will solve a generalization of the problem “Touring a Sequence of Polygons” where polygons can be concave and a weight is considered when visiting them. The main idea to solve the problem is triangulation of the polygons and adding some Steiner on the edges. We will also use a modified version of BUSHWHACK algorithm to find the shortest path among Steiner points. The running ti...
متن کاملNew Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کاملRobust Incremental Polygon Triangulation for Fast Surface Rendering
This paper presents a simple, robust and practical, yet fast algorithm for triangulation of points on the domain of trimmed Bézier surfaces. These R points are input to this algorithm by a surface sampler. A set of polygons is formed from these samples, which are then triangulated. We also show how to update the triangulation when the samples, and hence the polygons, are updated. The output is ...
متن کاملExperiments on Parallel Polygon Triangulation Using Ear Clipping
We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call three consecutive vertices of a polygon an ear if the triangle that is spanned by them is completely inside of the polygon. Extensive tests on thousands of sample polygons indicate that most polygons have a linear number of ears. This experimental result suggests that polygon-trian...
متن کاملOn Hamiltonian Triangulations in
An n-vertex simple polygon P is said to have a Hamilto-nian Triangulation if it has a triangulation whose dual graph contains a Hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with Hamiltonian triangulations. and use it to devise O(n log n)-time algorithms to recognize such polygons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2015